WORST_CASE(?,O(n^2))

Solution:
---------

  "0" :: [] -(0)-> "A"(0, 0)
  "0" :: [] -(0)-> "A"(9, 3)
  "0" :: [] -(0)-> "A"(6, 3)
  "log" :: ["A"(3, 3)] -(1)-> "A"(0, 0)
  "min" :: ["A"(12, 3) x "A"(0, 0)] -(1)-> "A"(12, 3)
  "quot" :: ["A"(9, 3) x "A"(0, 0)] -(1)-> "A"(6, 3)
  "s" :: ["A"(15, 3)] -(12)-> "A"(12, 3)
  "s" :: ["A"(0, 0)] -(0)-> "A"(0, 0)
  "s" :: ["A"(12, 3)] -(9)-> "A"(9, 3)
  "s" :: ["A"(6, 3)] -(3)-> "A"(3, 3)
  "s" :: ["A"(9, 3)] -(6)-> "A"(6, 3)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0, 0)
  "0" :: [] -(0)-> "A"_cf(3, 0)
  "0" :: [] -(0)-> "A"_cf(3, 1)
  "log" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "min" :: ["A"_cf(3, 0) x "A"_cf(0, 0)] -(1)-> "A"_cf(0, 0)
  "min" :: ["A"_cf(3, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(3, 0)
  "min" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "quot" :: ["A"_cf(3, 0) x "A"_cf(0, 0)] -(1)-> "A"_cf(3, 0)
  "quot" :: ["A"_cf(0, 0) x "A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)
  "s" :: ["A"_cf(3, 0)] -(3)-> "A"_cf(3, 0)
  "s" :: ["A"_cf(0, 0)] -(0)-> "A"_cf(0, 0)


Base Constructors:
------------------